On Secrecy Capacity of Minimum Storage Regenerating Codes
نویسندگان
چکیده
منابع مشابه
Searching for Minimum Storage Regenerating Codes
Regenerating codes allow distributed storage systems to recover from the loss of a storage node while transmitting the minimum possible amount of data across the network. We present a systematic computer search for optimal systematic regenerating codes. To search the space of potential codes, we reduce the potential search space in several ways. We impose an additional symmetry condition on cod...
متن کاملA Note on Secure Minimum Storage Regenerating Codes
This short note revisits the problem of designing secure minimum storage regenerating (MSR) codes for distributed storage systems. A secure MSR code ensures that a distributed storage system does not reveal the stored information to a passive eavesdropper. The eavesdropper is assumed to have access to the content stored on l1 number of storage nodes in the system and the data downloaded during ...
متن کاملOn Heterogeneous Regenerating Codes and Capacity of Distributed Storage Systems
Heterogeneous Distributed Storage Systems (DSS) are close to real world applications for data storage. Internet caching system and peer-to-peer storage clouds are the examples of such DSS. In this work, we calculate the capacity formula for such systems where each node store different number of packets and each having a different repair bandwidth (node can be repaired by contacting a specific s...
متن کاملHybrid Regenerating Codes for Distributed Storage Systems
Distributed storage systems are mainly justified due to their ability to store data reliably over some unreliable nodes such that the system can have long term durability. Recently, regenerating codes are proposed to make a balance between the repair bandwidth and the storage capacity per node. This is achieved through using the notion of network coding approach. In this paper, a new variation ...
متن کاملGeneralization of Rashmi-Shah-Kumar Minimum-Storage-Regenerating Codes
In this paper, we propose a generalized version of the Rashmi-Shah-Kumar Minimum-Storage-Regenerating(RSKMSR) codes based on the product-matrix framework. For any (n, k, d) such that d ≥ 2k − 2 and d ≤ n − 1, we can directly construct an (n, k, d) MSR code without constructing a larger MSR code and shortening of the larger MSR code. As a result, the size of a finite field over which the propose...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2017
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2016.2647601